|
In mathematics and abstract algebra, a relation algebra is a residuated Boolean algebra expanded with an involution called converse, a unary operation. The motivating example of a relation algebra is the algebra 2''X''² of all binary relations on a set ''X'', that is, subsets of the cartesian square ''X''2, with ''R''•''S'' interpreted as the usual composition of binary relations ''R'' and ''S'', and with the converse of ''R'' interpreted as the inverse relation. Relation algebra emerged in the 19th-century work of Augustus De Morgan and Charles Peirce, which culminated in the algebraic logic of Ernst Schröder. The equational form of relation algebra treated here was developed by Alfred Tarski and his students, starting in the 1940s. Tarski and Givant (1987) applied relation algebra to a variable-free treatment of axiomatic set theory, with the implication that mathematics founded on set theory could itself be conducted without variables. ==Definition== A relation algebra (''L'', ∧, ∨, −, 0, 1, •, I, ) is an algebraic structure equipped with the Boolean operations of conjunction ''x''∧''y'', disjunction ''x''∨''y'', and negation ''x''−, the Boolean constants 0 and 1, the relational operations of composition ''x''•''y'' and converse ''x'', and the relational constant I, such that these operations and constants satisfy certain equations constituting an axiomatization of relation algebras. A relation algebra is to a system of binary relations on a set containing the empty (0), complete (1), and identity (I) relations and closed under these five operations as a group is to a system of permutations of a set containing the identity permutation and closed under composition and inverse. Following Jónsson and Tsinakis (1993) it is convenient to define additional operations ''x''◁''y'' = ''x''•''y'', and, dually, ''x''▷''y'' = ''x''•''y'' . Jónsson and Tsinakis showed that I◁''x'' = ''x''▷I, and that both were equal to ''x''. Hence a relation algebra can equally well be defined as an algebraic structure (''L'', ∧, ∨, −, 0, 1, •, I, ◁, ▷). The advantage of this signature over the usual one is that a relation algebra can then be defined in full simply as a residuated Boolean algebra for which I◁''x'' is an involution, that is, I◁(I◁''x'') = ''x'' . The latter condition can be thought of as the relational counterpart of the equation 1/(1/''x'') = ''x'' for ordinary arithmetic reciprocal, and some authors use reciprocal as a synonym for converse. Since residuated Boolean algebras are axiomatized with finitely many identities, so are relation algebras. Hence the latter form a variety, the variety RA of relation algebras. Expanding the above definition as equations yields the following finite axiomatization. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Relation algebra」の詳細全文を読む スポンサード リンク
|